A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

垃圾评论自动过滤方法

针对互联网上存在的大量垃圾评论,提出一种基于电阻网络的垃圾评论检测方法,该方法用电阻距离来度量评论之间的上下文语义相似性,把整个评论数据表示成一个电阻网络,把垃圾评论当作该网络上的语义离群点来处理,根据网络节点对电阻网络平均电能消耗的影响,建立电离群因子来度量数据的离群程度,以此来识别垃圾评论。实验证明了该方法的有效性,在多个数据集上取得了较好的效果。     

要地反巡探测系统漏警率的建模及评估

要地反巡探测系统的设计需根据作战指标确定系统能力,此问题涉及到系统的建模及效能评估。应用随机服务理论,对要地反巡探测系统的搜索过程建立了M/D/C模型。根据M/D/C模型计算公式,以AR320地基监视雷达、地空联合探测的搜索过程为算例,验证了搜索模型的正确性,给出了目标漏警率、搜索波束数量与目标出动强度的关系。此模型扩展性良好,研究结果可对系统的设计和评价有所借鉴。     

对高重频PD雷达的舍脉冲干扰

高重频PD雷达是为解决测速模糊而在机载雷达中广泛采用的一种PD雷达工作模式,从PD雷达的特性来讲,由于带宽比较窄使得噪声干扰能量利用效率不是很高。采用DRFM精确获取雷达信号实施干扰是当前干扰的发展方向,但是对占空比接近50%的高重频PD雷达,采用对低重频PD及中重频PD可行的距离拖引,速度拖引等一系列在雷达信号脉冲串间隔内产生复杂调制的干扰方法是不合适的。主要针对高重频PD雷达重频高、占空比大的特点,提出了一种舍脉冲干扰方法,对DRFM截获的雷达信号进行快速部分转发,间隔一定脉冲数舍弃一个脉冲,改变原雷达信号的脉冲重复周期,使得在频域上产生多个速度欺骗性干扰信号,并通过仿真验证了干扰的有效性。     

针对高职学生特点巧讲新解部分高数知识

本文先介绍高等职业教育的特点、目前高职学生的情况以及高等数学课在高职教育中的定位,进而说明高职高等数学教学内容整理的必要性,然后给出巧讲新解的部分高数知识,最后进行总结。     

多媒体教学在高校文学课中的应用

多媒体教学以其题材丰富形象、形式新颖、课堂信息量大、节约课堂时间等优势,确立了在现代教学手段中的主要地位。但现阶段的多媒体教学还存在一些需要改进之处。本文分析了高校文学课多媒体教学的利弊,探讨了多媒体教学应用中出现的问题,并提出了相应的改进对策。     

多分辨率建模在战役推演仿真系统中的应用

战役推演仿真系统中存在大量分布在不同层次上的实体,为了使这些实体高效运行,同时保证相关信息能正确交互,研究了几种典型的多分辨率建模方法,并在分析战役推演仿真系统结构的基础上提出了一种面向多分辨率建模的仿真模块体系结构,建立了层次关系表、运行实体关系表、参数映射类和聚合解聚触发事件列表来保证多分辨率模型之间运行数据的一致性,同时避免链式解聚的问题.通过实验,按该体系结构建立的仿真系统能正确运行多分辨率模型,该框架为建立基于多分辨率建模的仿真系统提供了一定的技术支撑.     

基于CAM的认知超宽带频谱感知方法

频谱感知是认知超宽带系统的核心部分,针对超宽带频带内授权信号类型确定的特点,为了弥补自相关检测不能够识别信号类型的缺点,提出利用信号的循环谱特征和自相关矩阵差异性来检测授权信号,该方法融合了自相关检测和循环谱检测的优点进行合作判决。仿真表明该方法在高低信噪比环境下均能比循环谱检测和能量检测得到更好地检测效果,因此适合于认知超宽带系统。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010